Chapter 1 Online Scheduling Susanne Albers University of Freiburg, Germany

Source URL: www14.in.tum.de

• Scheduling
• Computational complexity theory
• Operations research
• Mathematics
• Applied mathematics
• Analysis of algorithms
• Online algorithms
• Combinatorial optimization
• Makespan
• Job shop scheduling
• Algorithm
• Randomized algorithm

Online Optimization of Busy Time on Parallel Machines∗ Mordechai Shalom1 Ariella Voloshin2 Prudence W.H. Wong3 Fencol C.C. Yung3 Shmuel Zaks2

Source URL: cgi.csc.liv.ac.uk

• Scheduling
• Operations research
• Mathematical optimization
• Combinatorial optimization
• Independent set
• Interval scheduling
• Interval graph
• Bin packing problem
• Algorithm
• Steve Jobs
• Job shop scheduling
• Multiprocessor scheduling

Job Shop Scheduling with Setup Times: Exploring the Applicability of a Constraint-based Iterative Sampling Approach Angelo Oddi1 , Riccardo Rasconi1 , Amedeo Cesta1 , and Stephen F. Smith2 1 Institute of Cognitive Scienc

Source URL: ceur-ws.org

• Operations research
• Edsger W. Dijkstra
• Constraint satisfaction
• Mathematical optimization
• Scheduling
• Heuristic
• Shortest path problem
• Local search

A HEURISTIC FOR THE JOB SHOP SCHEDULING PROBLEM Hugo Zupan, Niko Herakoviˇc Faculty of Mechanical Engineering, University of Ljubljana, Slovenia ,

Source URL: bioma.ijs.si

• Operations research
• Mathematical optimization
• Search algorithms
• Combinatorial optimization
• Metaheuristics
• Job shop scheduling
• Heuristic
• Genetic algorithm
• Travelling salesman problem
• Constructive heuristic
• Ant colony optimization algorithms
• Algorithm

A bio-inspired mobile agent-based integrated system for flexible autonomic job shop scheduling

Source URL: iel.ucdavis.edu

11. A PPROXIMATION A LGORITHMS ‣ load balancing ‣ center selection ‣ pricing method: vertex cover ‣ LP rounding: vertex cover ‣ generalized load balancing

Source URL: vigna.di.unimi.it

• Scheduling
• Operations research
• NP-complete problems
• Complexity classes
• Combinatorial optimization
• Makespan
• Knapsack problem
• NP
• Algorithm
• Vertex cover
• Approximation algorithm
• Job shop scheduling

A Job-Shop Scheduling Task for Evaluating Coordination during Computer Supported Collaboration

Source URL: dgergle.soc.northwestern.edu

CME 305: Discrete Mathematics and Algorithms 1 Approximation Algorithms

Source URL: stanford.edu

• Operations research
• Computational complexity theory
• NP-complete problems
• Job shop scheduling
• Mathematical optimization
• Approximation algorithm
• Linear programming
• Algorithm
• Vertex cover
• Theoretical computer science
• Applied mathematics
• Mathematics

CME 305: Discrete Mathematics and Algorithms Instructor: Professor Amin Saberi () Midterm – Problem 1. Show that a graph has a unique minimum spanning tree if, for every cut of the graph, th

Source URL: stanford.edu

• Combinatorial optimization
• Minimum spanning tree
• Spanning tree
• Job shop scheduling
• Maximum flow problem
• Max-flow min-cut theorem
• Cut
• Connectivity
• David Shmoys
• Graph theory
• Mathematics
• Theoretical computer science

A Comparison of Scheduling Approaches for Mixed-Parallel Applications on Heterogeneous Platforms Tchimou N’Takp´e ∗ Fr´ed´eric Suter Nancy University / LORIA UMR 7503 CNRS - INPL - INRIA - Nancy 2 - UHP, Nancy 1

Source URL: navet.ics.hawaii.edu

• Scheduling
• SimGrid
• Task parallelism
• Job shop scheduling
• Computer cluster
• Distributed computing
• Algorithm
• SIMD
• Data parallelism
• Concurrent computing
• Computing
• Parallel computing